A (log n)Ω(1) integrality gap for the Sparsest Cut SDP
نویسندگان
چکیده
We show that the Goemans-Linial semidefinite relaxation of the Sparsest Cut problem with general demands has integrality gap (log n)Ω(1). This is achieved by exhibiting n-point metric spaces of negative type whose L1 distortion is (log n)Ω(1). Our result is based on quantitative bounds on the rate of degeneration of Lipschitz maps from the Heisenberg group to L1 when restricted to cosets of the center. Keywords-Sparsest Cut problem; semidefinite programming; integrality gap; metric embeddings; Heisenberg group.
منابع مشابه
SDP Integrality Gaps with Local `1-Embeddability
We construct integrality gap instances for SDP relaxation of the MAXIMUM CUT and the SPARSEST CUT problems. If the triangle inequality constraints are added to the SDP, then the SDP vectors naturally define an n-point negative type metric where n is the number of vertices in the problem instance. Our gap-instances satisfy a stronger constraint that every sub-metric on t = O((log log log n) 1 6 ...
متن کاملSparsest Cut on Quotients of the Hypercube
We present a simple construction and analysis of an Ω(log log N) integrality gap for the wellknown Sparsest Cut semi-definite program (SDP). This holds for the uniform demands version (i.e. edge expansion). The same quantitative gap was proved earlier by Devanur, Khot, Saket, and Vishnoi [STOC 2006], following an integrality gap for non-uniform demands due to Khot and Vishnoi [FOCS 2005]. These...
متن کاملApproximation Algorithms for Min UnCut, Min 2CNF Deletion, and Directed Cut Problems
We give O( √ logn)-approximation algorithms for the Min UnCut, Min 2CNF Deletion, Directed Balanced Separator, and Directed Sparsest Cut problems. The previously best known algorithms give anO(logn)-approximation for Min UnCut [9], Directed Balanced Separator [17], Directed Sparsest Cut [17], and an O(logn log logn)approximation for Min 2CNF Deletion [14]. We also show that the integrality gap ...
متن کاملAdvanced Approximation Algorithms ( CMU 18 - 854 B , Spring 2008 ) Lecture 27 : Algorithms for Sparsest Cut Apr 24 , 2008
In lecture 19, we saw an LP relaxation based algorithm to solve the sparsest cut problem with an approximation guarantee of O(logn). In this lecture, we will show that the integrality gap of the LP relaxation is O(logn) and hence this is the best approximation factor one can get via the LP relaxation. We will also start developing an SDP relaxation based algorithm which provides an O( √ log n) ...
متن کاملIntegrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy
Linear and semidefinite programming are highly successful approaches for obtaining good approximations for NP-hard optimization problems. For example, breakthrough approximation algorithms for Max Cut and Sparsest Cut use semidefinite programming. Perhaps the most prominent NP-hard problem whose exact approximation factor is still unresolved is Vertex Cover. Probabilistically checkable proof (P...
متن کامل